Symmetric divisible designs with k − λ1 = 1

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Group divisible designs GDD(n, n, n, 1; λ1, λ2)

We give a complete solution for the existence problem of group divisible designs (or PBIBDs) with blocks of size k = 3, four groups of size (n, n, n, 1), and any two indices (λ1, λ2). Moreover, we introduce a construction of infinitely many group divisible designs with t groups of size n and one group of size 1. The construction technique utilizes our main result, together with some other known...

متن کامل

Flag-transitive point-primitive $(v,k,4)$ symmetric designs with exceptional socle of Lie type

Let $G$ be an automorphism group of a‎ ‎$2$-$(v,k,4)$ symmetric design $mathcal D$‎. ‎In this paper‎, ‎we‎ ‎prove that if $G$ is flag-transitive point-primitive‎, ‎then the‎ ‎socle of $G$ cannot be an exceptional group of Lie type‎.

متن کامل

Linked system of symmetric group divisible designs of type II

The linked systems of symmetric group divisible designs of type II is introduced, and several examples are obtained from affine resolvable designs and mutually UFS Latin squares. Furthermore, an equivalence between such symmetric group divisible designs and some association schemes with 5-classes is provided.

متن کامل

Partitioning Quadrics, Symmetric Group Divisible Designs and Caps

Using partitionings of quadrics we give a geometric construction of certain symmetric group divisible designs. It is shown that some of them at least are self-dual. The designs that we construct here relate to interesting work — some of it very recent — by D. Jungnickel and by E. Moorhouse. In this paper we also give a short proof of an old result of G. Pellegrino concerning the maximum size of...

متن کامل

Group Divisible Designs with Two Associate Classes and λ2=1

A pairwise balanced design is an ordered pair S,B , denoted PBD S,B , where S is a finite set of symbols, and B is a collection of subsets of S called blocks, such that each pair of distinct elements of S occurs together in exactly one block of B. Here |S| v is called the order of the PBD. Note that there is no condition on the size of the blocks in B. If all blocks are of the same size k, then...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1991

ISSN: 0012-365X

DOI: 10.1016/0012-365x(91)90418-2